Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
961	Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:09:48 NP-complete problems Parameterized complexity Kernelization Vertex cover Graph coloring Minimum k-cut Algorithm Independent set Greedy algorithm Theoretical computer science Mathematics Computational complexity theory
962	Research internship (Master M2) Title Verification of Distributed Systems with Parameterized Network Topology Description Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2014-10-03 08:24:08 Computational complexity theory Automata theory Symposium on Theoretical Aspects of Computer Science Cryptographic protocols Model checking Network topology
963	The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data∗ Brynmor Chapman† Stanford University Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-12-10 16:56:25 Complexity classes Circuit complexity Pseudorandomness Computability theory Advice Pseudorandom generator ACC0 Natural proof Boolean circuit Theoretical computer science Computational complexity theory Applied mathematics
964	Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas Ryan Williams∗ Carnegie Mellon University Abstract Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2008-04-30 19:50:48 Complexity classes True quantified Boolean formula Alternating Turing machine FO DTIME NTIME Time complexity SL Turing machine Theoretical computer science Computational complexity theory Applied mathematics
965	How to Compress Interactive Communication Boaz Barak∗ Mark Braverman† Xi Chen‡ Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2011-10-10 23:50:06 Information theory Communication Cybernetics Information Age Communication complexity Entropy Pseudorandomness Mutual information Decision tree model Theoretical computer science Applied mathematics Computational complexity theory
966	On the hardness of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:57:00 Analysis of algorithms Time complexity Polynomials NP Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Mathematics Computational complexity theory
967	Group Non-negative Matrix Factorization with Natural Categories for Question Retrieval in Community Question Answer Archives Guangyou Zhou, Yubo Chen, Daojian Zeng, and Jun Zhao National Laboratory of Pattern Recognition Add to Reading List Source URL: anthology.aclweb.org Language: English - Date: 2014-08-08 12:19:00 Matrix theory Numerical linear algebra Complexity classes Multivariate statistics NP Computational complexity theory Non-negative matrix factorization Learning to rank BM25 Algebra Mathematics Linear algebra
968	114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Network theory Search algorithms Graph theory Communication Communication complexity Quantum complexity theory Shortest path problem Randomized algorithm Breadth-first search Theoretical computer science Mathematics Applied mathematics
969	CCCG 2006, Kingston, Ontario, August 14–16, 2006 A Simple Streaming Algorithm for Minimum Enclosing Balls Hamid Zarrabi-Zadeh∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:59:03 Computational complexity theory Computational geometry Linear programming Analysis of algorithms LP-type problem Algorithm Time complexity Streaming algorithm Minimum bounding box algorithms Theoretical computer science Applied mathematics Mathematics
970	The Complexity of Model Checking Multi-Stack Systems Benedikt Bollig Laboratoire Sp´ecification et V´erification, ´ Ecole Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2013-08-22 11:45:56 Mathematics Symbol Nested word Temporal logic Interpretation Structure Linguistics Normal distribution Formal languages Model theory Logic

UPDATE